Growth rate of binary words avoiding xxx
نویسندگان
چکیده
منابع مشابه
GROWTH RATE OF BINARY WORDS AVOIDING xxx
Consider the set of those binary words with no non-empty factors of the form xxx. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the existence of upper and lower bounds on the number of such words of length n, where each of these bounds is asymptotically equivalent to a (different) function of th...
متن کاملGrowth rate of binary words avoiding xxxR
Consider the set of those binary words with no non-empty factors of the form xxx R. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the existence of upper and lower bounds on the number of such words of length n, where each of these bounds is asymptotically equivalent to a (different) function of ...
متن کاملBinary Words Avoiding xxx and Strongly Unimodal Sequences
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxxR was intermediate between polynomial and exponential. We now show that the same result holds for the growth of the number of binary words avoiding the pattern xxRx. Curiously, the analysis for xxRx is much simpler than that for xxxR. We derive our results by giving a bijection be...
متن کاملGeneration of binary words avoiding alternating patterns
In this paper we propose an algorithm to generate binary words with no more 0’s than 1’s having a fixed number of 1’s and avoiding the pattern (10)1 for any fixed j ≥ 1. We will prove that this generation is exhaustive, that is, all such binary words are generated.
متن کاملCounting Binary Words Avoiding Alternating Patterns
Let F [p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F [p].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.11.004